Adaptive Regularization in Convex Composite Optimization for Variational Imaging Problems

نویسندگان

  • Byung-Woo Hong
  • Ja-Keoung Koo
  • Hendrik Dirks
  • Martin Burger
چکیده

We propose an adaptive parameter balancing scheme in a variational framework where a convex composite energy functional that consists of data fidelity and regularization is optimized. In our adaptive parameter balancing, the relative weight is assigned to each term of the energy for indicating its significance to the total energy, and is automatically determined based on the data fidelity measuring how well the data fits the model at each energy optimization step. The adaptive balancing parameter is designed to locally control the regularity by taking into consideration the residual at each point without introducing any a-priori knowledge. We demonstrate that our adaptive balancing parameter is effective to improve the quality of the solution by determining the degree of regularity based on the local residual in the application of imaging problems. We apply our adaptive parameter balancing scheme to the classical imaging problems that are denoising, segmentation and motion estimation, and provide their optimization algorithms based on the alternating direction method of multipliers (ADMM) method. The robustness and effectiveness of our adaptive parameter balancing is demonstrated through experimental results presenting that the qualitative and quantitative evaluation results of each imaging task with an adaptive balancing parameter is superior to the results with a static one. The desired properties, robustness and effectiveness, of the parameter selection in a variational framework for imaging problems are achieved by merely replacing the static balancing parameter with our adaptive one.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Resolution Radar/SAR Imaging: An Experiment Design Framework Combined With Variational Analysis Regularization

The convex optimization-based descriptive experiment design regularization (DEDR) method is aggregated with the variational analysis (VA) approach for adaptive high-resolution sensing into a unified DEDR-VA framework that puts in a single optimization frame highresolution radar/SAR image formation in uncertain operational scenarios, adaptive despeckling and dynamic scene image enhancement for a...

متن کامل

A Smoothed Dual Approach for Variational Wasserstein Problems

Variational problems that involve Wasserstein distances have been recently proposed to summarize and learn from probability measures. Despite being conceptually simple, such problems are computationally challenging because they involve minimizing over quantities (Wasserstein distances) that are themselves hard to compute. We show that the dual formulation of Wasserstein variational problems int...

متن کامل

Resolution-enhanced radar/SAR imaging: an experiment design framework combined with neural network-adapted variational analysis regularization

The convex optimization-based descriptive experiment design regularization (DEDR) method is aggregated with the neural network (NN)-adapted variational analysis (VA) approach for adaptive high-resolution sensing into a unified DEDR -VA-NN framework that puts in a single optimization frame high-resolution radar/SAR image formation in uncertain operational scenarios, adaptive despeckling and dyna...

متن کامل

Adaptive Regularization of Some Inverse Problems in Image Analysis

We present an adaptive regularization scheme for optimizing composite energy functionals arising in image analysis problems. The scheme automatically trades off data fidelity and regularization depending on the current data fit during the iterative optimization, so that regularization is strongest initially, and wanes as data fidelity improves, with the weight of the regularizer being minimized...

متن کامل

The Rate of Convergence of Augmented Lagrange Method for a Composite Optimization Problem

In this paper we analyze the rate of local convergence of the augmented Lagrange method for solving optimization problems with equality constraints and the objective function expressed as the sum of a convex function and a twice continuously differentiable function. The presence of the non-smoothness of the convex function in the objective requires extensive tools such as the second-order varia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017